Secure Multiparty Quantum Computation for Summation and Multiplication

نویسندگان

  • Run-hua Shi
  • Yi Mu
  • Hong Zhong
  • Jie Cui
  • Shun Zhang
چکیده

As a fundamental primitive, Secure Multiparty Summation and Multiplication can be used to build complex secure protocols for other multiparty computations, specially, numerical computations. However, there is still lack of systematical and efficient quantum methods to compute Secure Multiparty Summation and Multiplication. In this paper, we present a novel and efficient quantum approach to securely compute the summation and multiplication of multiparty private inputs, respectively. Compared to classical solutions, our proposed approach can ensure the unconditional security and the perfect privacy protection based on the physical principle of quantum mechanics.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

پروتکل کارا برای جمع چندسویه امن با قابلیت تکرار

In secure multiparty computation (SMC), a group of users jointly and securely computes a mathematical function on their private inputs, such that the privacy of their private inputs will be preserved. One of the widely used applications of SMC is the secure multiparty summation which securely computes the summation value of the users’ private inputs. In this paper, we consider a secure multipar...

متن کامل

Active Security in Multiparty Computation over Black-Box Groups

Most previous work on unconditionally secure multiparty computation has focused on computing over a nite eld (or ring). Multiparty computation over other algebraic structures has not received much attention, but is an interesting topic whose study may provide new and improved tools for certain applications. At CRYPTO 2007, Desmedt et al introduced a construction for a passive-secure multiparty ...

متن کامل

Design and formal verification of DZMBE+

In this paper, a new broadcast encryption scheme is presented based on threshold secret sharing and secure multiparty computation. This scheme is maintained to be dynamic in that a broadcaster can broadcast a message to any of the dynamic groups of users in the system and it is also fair in the sense that no cheater is able to gain an unfair advantage over other users. Another important feature...

متن کامل

Multiparty computation unconditionally secure against adversary structures

We present here a generalization of the work done by Rabin and Ben-Or in [RBO]. We give a protocol for multiparty computation which tolerates any active adversary structure based on the existence of a broadcast channel, secure communication between each pair of participants, and a monotone span program with multiplication tolerating the structure. The secrecy achieved is unconditional although ...

متن کامل

Conditionally Secure Secrecy Computation using Secret Sharing Scheme for n<2k-1 (full paper)

Typically, when secrecy multiplication is performed in multiparty computation using Shamir’s (k, n) threshold secret sharing scheme, the result is a polynomial with degree of 2k − 2 instead of k − 1. This causes a problem where, in order to reconstruct a multiplication result, the number of polynomials needed will increase from k to 2k − 1. Shingu et al. proposed a method to solve the problem t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره 6  شماره 

صفحات  -

تاریخ انتشار 2016